The Variable Determinacy Thesis

نویسندگان

  • Harry Surden
  • Matthew Hale
چکیده

This Article proposes a novel technique for characterizing the relative determinacy of legal decision-making. I begin with the observation that the determinacy of legal outcomes varies from context to context within the law. To augment this intuition, I develop a theoretical model of determinate legal decision-making. This model aims to capture the essential features that are typically associated with the concept of legal determinacy. I then argue that we can use such an idealized model as a standard for expressing the relative determinacy or indeterminacy of decision-making in actual, observed legal contexts. From a legal theory standpoint, this approach – separating determinacy and indeterminacy into their constituent conceptual elements – helps us to more rigorously define these theoretical ideas. Ultimately, from a practical standpoint, I assert that this framework assists in understanding why legal outcomes in certain contexts are determinate enough to be amenable to resolution by computers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real Blackwell Determinacy

This bachelor thesis investigates the possibility to extend Blackwell Determinacy to the reals and discusses two possibilities. One uses measures with countable support—the other endows the reals with the Euclidean topology. At the end we propose a possible application.

متن کامل

Asset Prices, Monetary Policy and Macroeconomic Stability

A focal point of macroeconomic policy analysis over the past decade has been whether central banks should respond to changes in asset prices. This thesis addresses the question from the distinct perspective of equilibrium determinacy. By obtaining the conditions for equilibrium determinacy, it is possible to ascertain whether a central bank could induce additional volatility in an economy by ad...

متن کامل

An Introduction to Proofs of Determinacy of Long Games

We present the basic methods used in proofs of determinacy of long games, and apply these methods to games of continuously coded length. From the dawn of time women and men have aspired upward. The development of determinacy proofs is no exception to this general rule. There has been a steady search for higher forms of determinacy, beginning with the results of Gale–Stewart [2] on closed length...

متن کامل

The Church Problem for Countable Ordinals

A fundamental theorem of Büchi and Landweber shows that the Church synthesis problem is computable. Büchi and Landweber reduced the Church Problem to problems about ω-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length....

متن کامل

Counting and Randomising in Automata Theory –

This document is a non-technical reading guide for my PhD thesis, which is a contribution to the study of quantitative models of automata, and more specifically of automata with counters and probabilistic automata. The thesis manuscript consists of two chapters of equal length, the first about finite-memory determinacy for boundedness games, and the second about the value 1 problem for probabil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011